Implementasi Algoritma K-Means Dalam Clustering Rejection Patung Tangan Keramik (Studi Kasus : PT.Mark Dynamics Indonesia,Tbk)
نویسندگان
چکیده
PT. Mark, Dynamics Indonesia Tbk is one of the companies engaged in printing Ceramic Hand Sculptures. This Sculpture already exists several cities outside city even company PT Mark Damica Indonesia. request orders and various customers who are abroad. In process making Eating Ceramics, this has a problem, namely Rejection that produced. Thick Bergolan Sompel research was conducted for Clustering based on items have been determined by Eemal/Company Leader Indonezia Tbk. ETMark still takes long time To assist Thk Sculpture, combined with an implementation tem-sem using K-Means Algorithm.
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملAnalisis dan Perancangan Wireless Roaming (Studi Kasus Universitas Baturaja)
Wireless roaming is one way to improve the reliability of a network of hotspots that are still using the topology Basic Service Set (BSS). When the user walks away from one access point (AP) or one AP die then begins to lose the signal, the mobile station (MS) is automatically connected with the AP to another without reconfiguring. Devices that support wireless roaming is the AP TP-Link TL-WR74...
متن کاملAdaptive K-Means Clustering
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering is based on K-means such that the data is partitioned into K clusters. In this method, the number of clusters is predefined and the technique is highly dependent on the initial identification of elements that represent...
متن کاملConstrained K-Means Clustering
We consider practical methods for adding constraints to the K-Means clustering algorithm in order to avoid local solutions with empty clusters or clusters having very few points. We often observe this phenomena when applying K-Means to datasets where the number of dimensions is n 10 and the number of desired clusters is k 20. We propose explicitly adding k constraints to the underlying clusteri...
متن کاملSubspace K-means clustering.
To achieve an insightful clustering of multivariate data, we propose subspace K-means. Its central idea is to model the centroids and cluster residuals in reduced spaces, which allows for dealing with a wide range of cluster types and yields rich interpretations of the clusters. We review the existing related clustering methods, including deterministic, stochastic, and unsupervised learning app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information System Research (JOSH)
سال: 2022
ISSN: ['2686-228X']
DOI: https://doi.org/10.47065/josh.v3i3.1521